On the decomposition of $k$-noncrossing RNA structures
نویسندگان
چکیده
An k-noncrossing RNA structure can be identified with an k-noncrossing diagram over [n], which in turn corresponds to a vacillating tableaux having at most (k − 1) rows. In this paper we derive the limit distribution of irreducible substructures via studying their corresponding vacillating tableaux. Our main result proves, that the limit distribution of the numbers of irreducible substructures in k-noncrossing, σ-canonical RNA structures is determined by the density function of a Γ(− ln τk , 2)-distribution for some τk < 1.
منابع مشابه
Central and local limit theorems for RNA structures.
A k-noncrossing RNA pseudoknot structure is a graph over {1,...,n} without 1-arcs, i.e. arcs of the form (i,i+1) and in which there exists no k-set of mutually intersecting arcs. In particular, RNA secondary structures are 2-noncrossing RNA structures. In this paper we prove a central and a local limit theorem for the distribution of the number of 3-noncrossing RNA structures over n nucleotides...
متن کاملRNA-LEGO: Combinatorial Design of Pseudoknot RNA
In this paper we enumerate k-noncrossing RNA pseudoknot structures with given minimum stack-length. We show that the numbers of k-noncrossing structures without isolated base pairs are significantly smaller than the number of all k-noncrossing structures. In particular we prove that the number of 3and 4-noncrossing RNA structures with stack-length ≥ 2 is for large n given by 311.2470 4! n(n−1)....
متن کاملCombinatorics of RNA structures with pseudoknots.
In this paper, we derive the generating function of RNA structures with pseudoknots. We enumerate all k-noncrossing RNA pseudoknot structures categorized by their maximal sets of mutually intersecting arcs. In addition, we enumerate pseudoknot structures over circular RNA. For 3-noncrossing RNA structures and RNA secondary structures we present a novel 4-term recursion formula and a 2-term recu...
متن کامل$k$-noncrossing RNA structures with arc-length $\ge 3$
In this paper we enumerate k-noncrossing RNA pseudoknot structures with given minimum arc-and stack-length. That is, we study the numbers of RNA pseudoknot structures with arc-length ≥ 3, stack-length ≥ σ and in which there are at most k − 1 mutually crossing bonds, denoted by T [3] k,σ (n). In particular we prove that the numbers of 3, 4 and 5-noncrossing RNA structures with arc-length ≥ 3 and...
متن کاملAsymptotic enumeration of RNA structures with pseudoknots.
In this paper, we present the asymptotic enumeration of RNA structures with pseudoknots. We develop a general framework for the computation of exponential growth rate and the asymptotic expansion for the numbers of k-noncrossing RNA structures. Our results are based on the generating function for the number of k-noncrossing RNA pseudoknot structures, Sk(n), derived in Bull. Math. Biol. (2008), ...
متن کامل